C语言动态链表的建立及其基本操作教程

typedef struct Node {
int data; // 假设为整型数据作为示例
struct Node *next;
} ListNode;

ListNode* createLinkedList() {
ListNode *head = NULL;
return head;
}

// 在链表头部添加节点
void insertAtHead(ListNode **head, int value) {
ListNode *newNode = (ListNode*)malloc(sizeof(ListNode));
newNode->data = value;
newNode->next = (*head);
(*head) = newNode;
}

// 尾部追加节点
void appendToList(ListNode** head_ref, int new_data)
{
ListNode* new_node = malloc(sizeof(ListNode));

if(*head_ref == NULL)
{
new_node->data = new_data;
new_node->next =(NULL);
*head_ref = new_node;
}
else
{
ListNode *last = *head_ref;

while(last->next != NULL)
last = last->next;

last->next = new_node;
new_node->data = new_data;
new_node->next = NULL;
}
}

ListNode* deleteNode(ListNode* head, int key) {
ListNode* temp = head, *prev;

if(temp!=NULL && temp->data==key){
head=head->next;
free(temp);
return head;
}

prev=temp;
temp =temp->next;

while(temp!=NULL && temp->data!=key){
prev = temp;
temp = temp->next;
}

if(temp==NULL)return head;

(prev)->next = temp->next;
free(temp);

return head;
}

bool searchInList(ListNode *start, int x) {
while(start != NULL) {
if(start->data == x)
return true;
start=start->next;
}
return false;
}